1
کامپیوتر و شبکه::
وظیفهٔ درشت
To deal with the scalability challenge, we first analyze the complexity of the ILP variables, and develop a Task- Processor-Cluster (TP-CLUSTER) algorithm, which combines fine tasks into coarse tasks and partitions processors into clusters, and uses these "coarse" inputs to find ILP results.
1) Algorithm flow: The idea of TP-CLUSTER algorithm is to combine fine tasks into coarse tasks to simultaneously reduce T and C , and if reducing T and C still cannot meet the demand of scalability, the algorithm bi-partitions the processors iteratively until the scalability demand is met.
• Phase 1 finds the proper number of coarse tasks k and processor clusters Pcluster that can meet the ILP solving demand.
If the calculated k is larger than P , then we can allocate coarse tasks on all processors and each processor can have at least one task.
• Phase 3 performs the ILP-based mapping with the k coarse tasks and Pcluster processor clusters using the ILP model in Section IV.
واژگان شبکه مترجمین ایران